Unanimity consistency in model-based belief merging∗

نویسندگان

  • Gabriella Pigozzi
  • Daniel Eckert
چکیده

The problem of the aggregation of inputs coming from different sources arises in several contexts. Examples are the combination of individual preferences (studied in social choice theory), opinions (judgment aggregation), and data (artificial intelligence). While a number of results are available in each of these disciplines, a question that has been addressed only recently is how similar these aggregation problems are, despite the different types of inputs they try to combine. In this paper we consider aggregation problems that can be expressed in a Boolean-logic framework. The approaches developed so far are bounded to the combination of the individuals’ explicitly stated propositions into a collective one. We argue instead that the combination of information needs to be extended to the set of entailed sentences. We therefore introduce a new condition (called unanimity consistency condition), stating that all the unanimously entailed sentences at the individual level should be preserved at the collective level. Finally, it is shown that recent findings in judgment aggregation imply an impossibility result for an aggregation procedure that satisfies our unanimity consistency condition. ∗A preliminary version of this paper as “Pareto consistency in a model-based perspective on judgment aggregation” appeared in G. Bonanno, W. van der Hoek, M. Wooldridge (eds.), Proceedings of LOFT 06, University of Liverpool, UK, 169–176, 2006.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

First-Order Belief Merging using Dilations

The aim of belief merging is to merge conflicting information while preserving as much of it as possible. Most proposals in the literature work with knowledge bases expressed in propositional logic. We propose a new framework for merging knowledge bases expressed in (subsets of) first-order logic. Dilation operators (a concept originally introduced by Bloch and Lang) are employed and developed,...

متن کامل

A consistency-based framework for merging knowledge bases

We present a framework for expressing various merging operators for belief sets. This framework generalises our earlier work on consistency-based belief revision and contraction. Two primary merging operators are identified: in the first approach, belief sources are consistently combined so that the result of merging knowledge bases K1, . . . ,Kn is a maximal consistent (if possible) set of for...

متن کامل

Consistency-based approaches to merging knowledge bases: preliminary report

We present a framework for investigating merging operators for belief sets. This framework is a generalisation of our earlier work concerning consistency-based belief revision and contraction. Two distinct merging operators are identified: in the first approach, belief sources are consistently combined so that the result of merging K1 and K2 is a maximal consistent (if possible) set of formulas...

متن کامل

Two Approaches to Merging Knowledge Bases

We present a framework for expressing different merging operators for belief sets. This framework is a generalisation of our earlier work concerning consistency-based belief revision and contraction. Two distinct merging operators are identified: in the first approach, belief sources are consistently combined so that the result of merging knowledge bases K1, . . . ,Kn is a maximal consistent (i...

متن کامل

Merging Rules: Preliminary Version

In this paper we consider the merging of rules or conditionals. In contrast to other approaches, we do not invent a new approach from scratch, for one particular kind of rule, but we are interested in ways to generalize existing revision and merging operators from belief merging to rule merging. First, we study ways to merge rules based on only a notion of consistency of a set of rules, and ill...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006